Nonautonomous stochastic search for global minimum in continuous optimization
نویسندگان
چکیده
منابع مشابه
Improved Cuckoo Search Algorithm for Global Optimization
The cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. To enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. Normally, the parametersof the cuckoo search are kept constant. This may lead todecreasing the efficiency of the algorithm. To cop...
متن کاملConvergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
Rommel G. Regis Mathematics Department Saint Joseph’s University, Philadelphia, PA 19131, USA, [email protected] June 23, 2010 This paper presents some simple technical conditions that guarantee the convergence of a general class of adaptive stochastic global optimization algorithms. By imposing some conditions on the probability distributions that generate the iterates, these stochastic algorithm...
متن کاملimproved cuckoo search algorithm for global optimization
the cuckoo search algorithm is a recently developedmeta-heuristic optimization algorithm, which is suitable forsolving optimization problems. to enhance the accuracy andconvergence rate of this algorithm, an improved cuckoo searchalgorithm is proposed in this paper. normally, the parametersof the cuckoo search are kept constant. this may lead todecreasing the efficiency of the algorithm. to cop...
متن کاملA Model Reference Adaptive Search Method for Stochastic Global Optimization
We propose a new method called Stochastic Model Reference Adaptive Search (SMRAS) for finding a global optimal solution to a stochastic optimization problem in situations where the objective functions cannot be evaluated exactly, but can be estimated with some noise (or uncertainty), e.g., via simulation. SMRAS is a generalization of the recently proposed Model Reference Adaptive Search (MRAS) ...
متن کاملAdaptive search with stochastic acceptance probabilities for global optimization
We present an extension of continuous domain Simulated Annealing. Our algorithm employs a globally reaching candidate generator, adaptive stochastic acceptance probabilities, and converges in probability to the optimal value. An application to simulation-optimization problems with asymptotically diminishing errors is presented. Numerical results on a noisy protein-folding problem are included.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2014
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2013.10.070